Calibrations, Monopoles and Fuzzy Funnels

We present new non-Abelian solitonic configurations in the low energy effective theory describing a collection of N parallel D1--branes. These configurations preserve 1/4, 1/8, 1/16 and 1/32 of the spacetime supersymmetry. They are solutions to a set of generalised Nahm's equations which are related to self-duality equations in eight dimensions. Our solutions represent D1--branes which expand into fuzzy funnel configurations ending on collections of intersecting D3--branes. Supersymmetry dictates that such intersecting D3--branes must lie on a calibrated three-surface of spacetime and we argue that the generalised Nahm's equations encode the data for the construction of magnetic monopoles on the relevant three-surfaces.Comment: 19 pages. Latex. v2: added references and acknowledgmen

Myth Making in the Heartland – Did Agriculture Elect the New President?

This essay addresses the role of America’s farmers in electing President Donald Trump. This role may not have been as large as the agricultural community and others have suggested. Additionally, this essay cautions the agricultural community against taking too much credit for the election of a politician and party whose interests are often at odds with agricultural interests

A Swiss Pocket Knife for Computability

This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and constructions, but with new criteria for success that are natural from a programming language perspective. Three cornerstones of computability theory are the S-m-ntheorem; Turing's "universal machine"; and Kleene's second recursion theorem. In today's programming language parlance these are respectively partial evaluation, self-interpretation, and reflection. In retrospect it is fascinating that Kleene's 1938 proof is constructive; and in essence builds a self-reproducing program. Computability theory originated in the 1930s, long before the invention of computers and programs. Its emphasis was on delimiting the boundaries of computability. Some milestones include 1936 (Turing), 1938 (Kleene), 1967 (isomorphism of programming languages), 1985 (partial evaluation), 1989 (theory implementation), 1993 (efficient self-interpretation) and 2006 (term register machines). The "Swiss pocket knife" of the title is a programming language that allows efficient computer implementation of all three computability cornerstones, emphasising the third: Kleene's second recursion theorem. We describe experiments with a tree-based computational model aiming for both fast program generation and fast execution of the generated programs.Comment: In Proceedings Festschrift for Dave Schmidt, arXiv:1309.455